A $\theta(n^2)$ Time Matrix Multiplication Algorithm
نویسنده
چکیده
We show that the 3 multiplications in (a0, a1, ..., a3m−1)(b0, b1, ..., b3m−1) T can be converted to 2 ( 2m+5 5 ) multiplications. Thus when m = 100, 3 < 2 ( 2m+5 5 ) . This gives a θ(n) time algorithm for matrix multiplication.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملOn Diameter Veri cation and Boolean Matrix Multiplication
We present a practical algorithm that veri es whether a graph has diameter 2 in time O n= log n . A slight adaptation of this algorithm yields a boolean matrix multiplication algorithm which runs in the same time bound; thereby allowing us to compute transitive closure and verify that the diameter of a graph is d, for any constant d, in O n= log n time.
متن کاملParallel Matrix Multiplication on a Linear Array with a Reconngurable Pipelined Bus System Parallel Matrix Multiplication on a Linear Array with a Reconngurable Pipelined Bus System
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity O(N), where 2 < < 3. The current best value of is less than 2.3755. We show that for all 1 p N , multiplying two N N matrices can be performed on a p-processor linear array with a reconngurable pipelined bus system (LARPBS) in O N p + N 2 p 2== log p time. This is currently the fa...
متن کاملLectures 1 and 2 Matrix Multiplication and Matrix Inversion 1 Prior Work on Matrix Multiplication
There has been much effort to improve the runtime of matrix multiplication. The trivial algorithm multiplies n×n matrices in O(n) time. Strassen (’69) surprised everyone by giving an O(n) time algorithm. This began a long line of improvements until in 1986, Coppersmith and Winograd achieved O(n). After 24 years of no progress, in 2010 Andrew Stothers, a graduate student in Edinburgh, improved t...
متن کاملImproved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our results show that the product of two n× n Boolean matrices can be computed on a quantum computer in time Õ(n3/2+nl3/4), where l is the number of non-zero entries in the product, improving over the outputsensitive quantum a...
متن کامل